On a class of nonlinear problems involving a p(x)-Laplace type operator
نویسندگان
چکیده
منابع مشابه
Existence of three solutions for a class of quasilinear elliptic systems involving the $p(x)$-Laplace operator
The aim of this paper is to obtain three weak solutions for the Dirichlet quasilinear elliptic systems on a bonded domain. Our technical approach is based on the general three critical points theorem obtained by Ricceri.
متن کاملNumerical solution of a class of singular free boundary problems involving the m-Laplace operator
s of IWANASP, September 10 – 12, 2008, Ericeira, Portugal NUMERICAL SOLUTION OF A CLASS OF SINGULAR FREE BOUNDARY PROBLEMS INVOLVING THE m-LAPLACE OPERATOR LUÍSA MORGADO 1 CEMAT ,Instituto Superior Técnico, Universidade de Trás-os-Montes e Alto Douro 1 Av. Rovisco Pais, 1049-001 Lisboa, 2 Quinta de Prados, 5001-811 Vila Real, Portugal E-mail: [email protected] PEDRO LIMA CEMAT, Instituto Superior ...
متن کاملA Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory
A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.
متن کاملThree solutions for a class of quasilinear elliptic systems involving the p(x)-Laplace operator
* Correspondence: [email protected]. cn Institute of Mathematics, School of Mathematical Sciences, Nanjing Normal University, Jiangsu Nanjing 210046, China Full list of author information is available at the end of the article Abstract The existence of at least three weak solutions is established for a class of quasilinear elliptic systems involving the p(x)-Laplace operator with Neumann boundary ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2008
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-008-0011-1